Refined Deterministic Algorithm for Biplane Construction
نویسندگان
چکیده
منابع مشابه
Refined Deterministic Algorithm for Biplane Construction
This paper introduces a way of constructing biplanes that uses “filters” in a step prior to an exhaustive computer search, with the objective to make the biplane construction more efficient. The achieved deterministic algorithm classifies biplanes of order 7 and smaller. When performing the search using some additional presumptive conditions, two biplanes of order 9 (k = 11) were constructed an...
متن کاملRefined Algorithms for Infinitely Many-Armed Bandits with Deterministic Rewards
We consider a variant of the Multi-Armed Bandit problem which involves a large pool of a priori identical arms (or items). Each arm is associated with a deterministic value, which is sampled from a probability distribution with unknown maximal value, and is revealed once that arm is chosen. At each time instant the agent may choose a new arm (with unknown value), or a previously-chosen arm whos...
متن کاملA refined EM algorithm for PH distributions
This paper proposes an improved computation method of maximum likelihood (ML) estimation for phase-type (PH) distributions with a number of phases. We focus on the EM (expectation-maximization) algorithm proposed by Asmussen et al. [27] and refine it in terms of time complexity. Two ideas behind our method are a uniformizationbased procedure for computing a convolution integral of the matrix ex...
متن کاملTransit Nodes - Lower Bounds and Refined Construction
We reconsider the concept of transit nodes as introduced by Bast et al. [3] and for the first time construct instance based lower bounds on the size of transit node sets by interpreting a LP formulation of the problem and its dual. As a side product we achieve considerably smaller access node sets which directly influences the query time for non-local queries.
متن کاملOn an Optimal Deterministic Algorithm for SAT
J. Kraj cek and P. Pudll ak proved that an almost optimal deterministic algorithm for TAUT exists if and only if there exists a p-optimal proof system for TAUT. In this paper we prove that an almost optimal deterministic algorithm for SAT exists if and only if there exists a p-optimal proof system for SAT. Combining Kraj cek and Pudll ak's result with our result we show that an optimal determin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computing and Information Technology
سال: 2010
ISSN: 1330-1136,1846-3908
DOI: 10.2498/cit.1001416